Cooperating Distributed Grammar Systems with Random Context Grammars as Components
نویسندگان
چکیده
منابع مشابه
Cooperating Distributed Grammar Systems with Random Context Grammars as Components
In this paper, we discuss cooperating distributed grammar systems where components are (variants of) random context grammars. We give an overview of known results and open problems, and prove some further results.
متن کاملCooperating Distributed Grammar Systems with Permitting Grammars as Components
This paper studies cooperating distributed grammar systems working in the terminal derivation mode where the components are variants of permitting grammars. It proves that although the family of permitting languages is strictly included in the family of random context languages, the families of random context languages and languages generated by permitting cooperating distributed grammar system...
متن کاملBidirectional Cooperating Distributed Grammar Systems Bidirectional Cooperating Distributed Grammar Systems
We consider bidirectional cooperating distributed (BCD) grammar systems in the sense of Asveld. Independently of their mode , , =, , or t, BCD grammar systems with two components characterize the re-cursively enumerable languages even with right-linear rules and without-productions. This sharply contrasts earlier results on solely generating or accepting grammars, where right-linear rules alway...
متن کاملCooperating Distributed Grammar Systems: Components with Nonincreasing Competence
We study the generative power of CD grammar systems (CDGSs) that use a cooperation protocol based on the level of competence on a sentential form — and the competence of their components does not increase during rewriting. A component of a CDGS is k-competent on a sentential form if it can rewrite exactly k different nonterminals appearing in that string. A CDGS with components that are nonincr...
متن کاملDeterministic Cooperating Distributed Grammar Systems
Subclasses of grammar systems that can facilitate parser construction appear to be of interest. In this paper, some syntactical conditions considered for strict deterministic grammars are extended to cooperating distributed grammar systems, restricted to the terminal derivation mode. Two variants are considered according to the level to which the conditions address. The local variant, which int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Cybernetica
سال: 2011
ISSN: 0324-721X
DOI: 10.14232/actacyb.20.2.2011.4